An Optimistic Protocol for a Linearizable Distributed Shared Memory System
نویسندگان
چکیده
Recently, distributed shared memory systems have received much attention because such an abstraction simpliies programming. In this paper , we present a simple protocol which implements the linearizability consistency criterion in a distributed shared memory system. Unlike previously implemented protocols, our protocol is based on an optimistic approach. The protocol eliminates the necessity of potentially expensive synchronization among processors for each write operation, but may require processes to rollback.
منابع مشابه
On Composition and Implementation of Sequential Consistency
To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for sequential consistency. This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequential...
متن کاملOn Composition and Implementation of Sequential Consistency (Extended Version)
It has been proved that to implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time proportional to the uncertainty in the latency of the network for both read and write operations, while waiting during read or during write operations is sufficient for sequential consistency. This paper extends this result to crash-prone asynchronous syste...
متن کاملKernel Level Speculative DSM
Interprocess communication (IPC) is ubiquitous in today’s computing world. One of the simplest mechanisms for IPC is shared memory. We present a system that enhances the System V IPC API to support distributed shared memory by using speculations. Speculations provide performance improvements by enabling rollback of overly optimistic speculative executions. The paper describes a speculative tota...
متن کاملAn Optimistic-Based Partition-Processing Approach for Distributed Shared Memory Systems
This paper investigates the problem of network partitioning in Distributed Shared Memory (DSM) systems. We propose an optimistic-based partition-processing approach, which can make shared pages available when network partitioning occurs. However, this approach does not guarantee that the same page in different partitions can maintain a consistent value. To eliminate this problem, a memory-based...
متن کاملEecient, Strongly Consistent Implementations of Shared Memory
We present linearizable implementations for two distributed organizations of multiprocessor shared memory. For the full caching organization , where each process keeps a local copy of the whole memory, we present a linearizable implementations of read/write memory objects that achieves essentially optimal eeciency and allows quantitative degradation of the less frequently employed operation. Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 6 شماره
صفحات -
تاریخ انتشار 1996